The Compatibility Graph 3
نویسندگان
چکیده
This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don't care sets. Speciically, given an incompletely speciied function g and a xed ordering of the variables, we propose an exact algorithm for selecting f such that f is a cover for g and the binary decision diagram for f is of minimum size. We proved that this problem is NP-complete. Here we show that the BDD minimization problem can be formulated as a binate covering problem and solved using implicit enumeration techniques similar to the ones used in the reduction of incompletely speciied nite state machines.
منابع مشابه
Discovering Pairwise Compatibility Graphs
Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two nonnegative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V,E), where each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ d...
متن کاملPairwise Compatibility Graphs
Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two non-negative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dm...
متن کاملTGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance
Edge bundling methods became popular for visualising large dense networks; however, most of previous work mainly relies on geometry to define compatibility between the edges. In this paper, we present a new framework for edge bundling, which tightly integrates topology, geometry and importance. In particular, we introduce new edge compatibility measures, namely importance compatibility and topo...
متن کاملA Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
In this paper we give a necessary condition and a sufficient condition for a graph to be a pairwise compatibility graph (PCG). Let G be a graph and let Gc be the complement of G. We show that if Gc has two disjoint chordless cycles then G is not a PCG. On the other hand, if Gc has no cycle then G is a PCG. Our conditions are the first necessary condition and the first sufficient condition for p...
متن کاملStreamEB: Stream Edge Bundling
1 Graph streams have been studied extensively, such as for data mining, while fairly limitedly for visualizations. Recently, edge bundling promises to diminish visual clutter in large graph visualizations, though mainly focusing on static graphs. This paper presents a new framework, namely StreamEB, for edge bundling of graph streams, which integrates temporal, neighbourhood, data-driven and sp...
متن کاملInferring Aggregation Hierarchies for Integration of Data Marts
The problem of integrating heterogeneous data marts is an important problem in building enterprise data warehouses. Specially identifying compatible dimensions is crucial to successful integration. Existing notions of dimension compatibility rely on given and exact dimension hierarchy information being available. In this paper, we propose to infer aggregation hierarchies for dimensions from a d...
متن کامل